Robustness Algorithms for the Airport Gate Assignment Problem
نویسندگان
چکیده
منابع مشابه
The over-constrained airport gate assignment problem
In this paper, we study the over-constrained airport gate assignment problem where the objectives are to minimize the number of ungated 4ights and total walking distances or connection times. We 7rst use a greedy algorithm to minimize ungated 4ights. Exchange moves are employed to facilitate the use of heuristics. Simulated annealing and a hybrid of simulated annealing and tabu search are used....
متن کاملThe Airport Gate Assignment Problem: A Survey
The airport gate assignment problem (AGAP) is one of the most important problems operations managers face daily. Many researches have been done to solve this problem and tackle its complexity. The objective of the task is assigning each flight (aircraft) to an available gate while maximizing both conveniences to passengers and the operational efficiency of airport. This objective requires a sol...
متن کاملAirport Gate Assignment Considering Ground Movement
Airports all over the world are becoming busier and many of them are facing capacity problems. The actual airport capacity strongly depends on the efficiency of the resource utilisation. Although simultaneously handling all of the problems may result in more effective resource utilisation, historically different types of airport resources have been handled independently. Despite introducing new...
متن کاملA Robust Approach for the Airport Gate Assignment
Airport gate assignment is a critical issue for the operation management of an airport. Airport gate assignment is to assign flights to gates according to their real-time arrival time and departure time, such that each flight is assigned to exactly one gate, and there is no conflict between two consecutive flights assigned to the same gate. We formulate the airport gate assignment as a stochast...
متن کاملAirport Gate Assignment: New Model and Implementation
airport operations. In this paper, we study the Airport Gate Assignment Problem (AGAP), propose a new model and implement the model with Optimization Programming language (OPL). With the objective to minimize the number of conflicts of any two adjacent aircrafts assigned to the same gate, we build a mathematical model with logical constraints and the binary constraints, which can provide an eff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Global Journal of Computer Science and Technology
سال: 2020
ISSN: 0975-4172,0975-4350
DOI: 10.34257/gjcstcvol20is1pg37